Oded Goldreich - PDFSEARCH.IO - Document Search Engine

Oded Goldreich
Results: 40

#	Item
31	Valiant’s Polynomial-Size Monotone Formula for Majority Oded Goldreich July 11, 2011 Summary: This text provides an exposition of Valiant’s proof of the existence of polynomial-size monotone formula for Majority. The Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2011-07-11 06:22:34 Circuit complexity Probability theory Real analysis Independence Statistical dependence Majority function PP FO Monotonic function Theoretical computer science Computational complexity theory Mathematical analysis
32	Joint Review of1 Computational Complexity: A Conceptual Perspective by Oded Goldreich Published by Cambridge University Press, [removed]pages, Hardcover and Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2010-09-24 20:19:20 Complexity classes Probabilistic complexity theory Structural complexity theory Models of computation Pseudorandom generator Probabilistically checkable proof NP P versus NP problem Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
33	Microsoft Word - Syllabus-COT6410-Spring2011 Add to Reading List Source URL: www.eecs.ucf.edu Language: English - Date: 2011-01-11 13:04:33 Probabilistic complexity theory Probabilistically checkable proof Complexity classes Final examination Oded Goldreich Midterm exam NP Homework Education Theoretical computer science Examinations
34	School of Engineering and Applied Sciences Maxwell Dworkin[removed]Oxford Street Cambridge, Massachusetts[removed]Salil P. Vadhan Add to Reading List Source URL: people.seas.harvard.edu Language: English - Date: 2014-06-13 16:45:51 Year of birth missing Theoretical computer science Oded Goldreich Symposium on Theory of Computing ACM SIGACT Ran Raz Shafi Goldwasser Avi Wigderson Salil Vadhan Applied mathematics Mathematical sciences Computer science
35	Invitation to Complexity Theory Complexity theory provides new viewpoints on various phenomena that were once considered by past thinkers. By Oded Goldreich DOI: [removed][removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2013-03-27 12:14:10 Probabilistic complexity theory Mathematical optimization Computational complexity theory Structural complexity theory Complexity Average-case complexity P versus NP problem NP-complete Pseudorandom generator Theoretical computer science Applied mathematics Complexity classes
36	On Struggle and Competition in Scientific Fields Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. January 24, 2012 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-01-24 00:20:46 Science Anthropology Competition Pierre Bourdieu
37	School of Engineering and Applied Sciences Maxwell Dworkin[removed]Oxford Street Cambridge, Massachusetts[removed]Salil P. Vadhan Add to Reading List Source URL: people.seas.harvard.edu Language: English - Date: 2013-08-06 11:37:49 Theoretical computer science Year of birth missing Oded Goldreich Avi Wigderson Shafi Goldwasser ACM SIGACT Ran Raz Symposium on Theory of Computing Salil Vadhan Applied mathematics Mathematical sciences Computer science
38	A Brief Introduction to Property Testing Oded Goldreich Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-07-22 08:07:13 Graph theory Property testing Computational complexity theory Locally testable code Graph property Representation Function Time complexity Algorithm Mathematics Theoretical computer science Applied mathematics
39	Basic Facts about Expander Graphs Oded Goldreich Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-07-22 08:07:13 Graph Zig-zag product Regular graph Adjacency matrix Expander mixing lemma Connectivity Degree Expander walk sampling Graph operations Graph theory Mathematics Expander graph
40	PDF Document Add to Reading List Source URL: www.ams.org Language: English - Date: 2008-01-24 11:26:55 Neal Koblitz Random oracle RSA Oded Goldreich Mathematical proof Alfred Menezes MQV Index of cryptography articles Cryptography Public-key cryptography Provable security